A Proof of Grünbaum’s Lower Bound Conjecture for general polytopes

نویسندگان

چکیده

In 1967, Grünbaum conjectured that any d-dimensional polytope with d + s ? 2d vertices has at least $${\phi _k}(d s,d) = \left( {\matrix{{d 1} \cr {k } \right) {\matrix{d - {\matrix{ {d 1 s} \right)$$ k-faces. We prove this conjecture and also characterize the cases in which equality holds.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A bound for Feichtinger conjecture

In this paper‎, ‎using the discrete Fourier transform in the finite-dimensional Hilbert space C^n‎, ‎a class of nonRieszable equal norm tight frames is introduced ‎and‎ using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...

متن کامل

On the Generalized Lower Bound Conjecture for Polytopes and Spheres

In 1971, McMullen and Walkup posed the following conjecture, which is called the generalized lower bound conjecture: If P is a simplicial d-polytope then its h-vector (h0, h1, . . . , hd) satisfies h0 ≤ h1 ≤ · · · ≤ h⌊ d2 ⌋. Moreover, if hr−1 = hr for some r ≤ d2 then P can be triangulated without introducing simplices of dimension ≤ d− r. The first part of the conjecture was solved by Stanley ...

متن کامل

A Proof of Hadwiger’s Covering Conjecture for Dual Cyclic Polytopes

In 1957, H. Hadwiger conjectured that a convex body K in a Euclidean d-space, d 1, can always be covered by 2 smaller homothetic copies of K. We verify this conjecture when K is the polar of a cyclic d-polytope. Mathematics Subject Classifications (1991): 52A15, 52A20.

متن کامل

A lower bound for the Laplacian eigenvalues of a graph—proof of a conjecture by Guo

We show that if μj is the j-th largest Laplacian eigenvalue, and dj is the j-th largest degree (1 ≤ j ≤ n) of a connected graph Γ on n vertices, then μj ≥ dj − j + 2 (1 ≤ j ≤ n− 1). This settles a conjecture due to Guo.

متن کامل

Proof for a Conjecture on General Means

We give a proof for a conjecture suggested by Olivier de La Grandville and Robert M. Solow, which says that the general mean of two positive numbers, as a function of its order, has one and only one inflection point.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2021

ISSN: ['1565-8511', '0021-2172']

DOI: https://doi.org/10.1007/s11856-021-2234-x